Checking Overlaps of Nominal Rewriting Rules
نویسندگان
چکیده
منابع مشابه
Checking Overlaps of Nominal Rewriting Rules
Nominal rewriting generalises first-order rewriting by providing support for the specification of binding operators. In this paper, we give sufficient conditions for (local) confluence of closed nominal rewriting theories, based on the analysis of rule overlaps. More precisely, we show that closed nominal rewriting rules where all proper critical pairs are joinable are locally confluent. We als...
متن کاملNominal rewriting
Nominal rewriting is based on the observation that if we add support for alphaequivalence to first-order syntax using the nominal-set approach, then systems with binding, including higher-order features such as lambda-calculus beta-reduction, can be smoothly represented. Nominal rewriting maintains a strict distinction between variables of the objectlanguage (atoms) and of the meta-language (va...
متن کاملClosed nominal rewriting and efficiently computable nominal
We analyse the relationship between nominal algebra and nominal rewriting, giving a new and concise presentation of equational deduction in nominal theories. With some new results, we characterise a subclass of equational theories for which nominal rewriting provides a complete and efficient procedure to check nominal algebra equality. This subclass includes specifications of lambda-calculus an...
متن کاملTypes for Nominal Rewriting?
We define a type inference system for Nominal Rewriting where the types associated to terms are polymorphic (built from a set of base data sorts, type variables, and user-defined type constructors). In contrast with standard term rewriting systems or the λ-calculus, a typing environment for nominal rewriting includes type information for atoms, variables and function symbols. We give a syntax-d...
متن کاملTermination of String Rewriting Rules That Have One Pair of Overlaps
This paper presents a partial solution to the long standing open problem of termination of one rule string rewriting Overlaps between the two sides of the rule play a central role in existing termination criteria We characterize termination of all one rule string rewriting systems that have one such overlap at either end This both completes a result of Kurth and generalizes a result of Shikishi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2016
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2016.06.004